Computing Synthetic Controls Using Bilevel Optimization

نویسندگان

چکیده

Abstract The synthetic control method (SCM) represents a notable innovation in estimating the causal effects of policy interventions and programs comparative case study setting. In this paper, we demonstrate that data-driven approach to SCM requires solving bilevel optimization problem. We show how original problem can be solved global optimum through introduction an iterative algorithm rooted Tykhonov regularization or Karush–Kuhn–Tucker approximations.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multiobjective bilevel optimization

In this work nonlinear non-convex multiobjective bilevel optimization problems are discussed using an optimistic approach. It is shown that the set of feasible points of the upper level function, the so-called induced set, can be expressed as the set of minimal solutions of a multiobjective optimization problem. This artificial problem is solved by using a scalarization approach by Pascoletti a...

متن کامل

Pessimistic bilevel linear optimization

In this paper, we investigate the pessimistic bilevel linear optimization problem (PBLOP). Based on the lower level optimal value function and duality, the PBLOP can be transformed to a single-level while nonconvex and nonsmooth optimization problem. By use of linear optimization duality, we obtain a tractable and equivalent transformation and propose algorithms for computing global or local op...

متن کامل

Pessimistic Bilevel Optimization

We study a variant of the pessimistic bilevel optimization problem, which comprises constraints that must be satisfied for any optimal solution of a subordinate (lower-level) optimization problem. We present conditions that guarantee the existence of optimal solutions in such a problem, and we characterize the computational complexity of various subclasses of the problem. We then focus on probl...

متن کامل

Discrete Bilevel Optimization Problems

Bilevel programming problems are hierarchical optimization problems in which the feasible set is determined by the set of optimal solutions of a second, parametric optimization problem. In this paper we consider problems where this second problem is a discrete one. We start with addressing the problem of the existence of optimal solutions. Then, an algorithm is proposed solving these problems. ...

متن کامل

Intersection Cuts for Bilevel Optimization

We address a generic Mixed-Integer Bilevel Linear Program (MIBLP), i.e., a bilevel optimization problem where all objective functions and constraints are linear, and some/all variables are required to take integer values. Rather than proposing an ad-hoc method applicable only to specific cases, we describe a general-purpose MIBLP approach. We first propose necessary modifications needed to turn...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computational Economics

سال: 2023

ISSN: ['1572-9974', '0927-7099']

DOI: https://doi.org/10.1007/s10614-023-10471-7